Semantic Characterisations of Second-Order Computability over the Real Numbers
نویسندگان
چکیده
منابع مشابه
Polynomial time computable real functions
In this paper, we study computability and complexity of real functions. We extend these notions, already defined for functions over closed intervals or over the real line to functions over particular real open sets and give some results and characterizations, especially for polynomial time computable functions. Our representation of real numbers as sequences of rational numbers allows us to imp...
متن کاملRecent Advances in S-Definability over Continuous Data Types
The purpose of this paper is to survey our recent research in computability and definability over continuous data types such as the real numbers, real-valued functions and functionals. We investigate the expressive power and algorithmic properties of the language of Σ-formulas intended to represent computability over the real numbers. In order to adequately represent computability we extend the...
متن کاملComputability and Complexity over the Product Topology of Real Numbers
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over “large” topological spaces. This framework has been applied to study the complexity of the differential operator and the complexity of functionals over the space of continuous functions on the unit interval C[0, 1]. In this paper we apply the ideas of Kawamura and Cook to the produ...
متن کاملA Functional Approach to Computability on Real Numbers
The aim of this thesis is to contribute to close the gap existing between the theory of computable analysis and actual computation. In order to study computability over real numbers we use several tools peculiar to the theory of programming languages. In particular we introduce a special kind of typed lambda calculus as an appropriate formalism for describing computations on real numbers. Furth...
متن کاملRepresentations of the real numbers and of the open subsets of the set of real numbers
In previous papers we have presented a unified Type 2 theory of computability and continuity and a theory of representations. In this paper the concepts developed so far are used for the foundation of a new kind of constructive analysis. Different standard representations of the real numbers are compared. It turns out that the crucial differences are of topological nature and that most of the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001